Clause Learning in SAT
نویسندگان
چکیده
The development of clause learning has had a tremendous effect on the overall performance of SAT-Solvers. Clause learning has allowed SAT-Solvers to tackle industrial sized problems that formerly would have required impractical time scales. The development of techniques for efficient clause management and storage have also proved important in reducing some of the memory usage problems inherent in naive clause learning strategies. This paper attempts an introduction to some better known clause-learning strategies as a comparison among these strategies. A brief explanation of some of the techniques available to minimize memory usage when storing learned clauses in a database is also presented.
منابع مشابه
Incorporating Clause Learning in Grid-Based Randomized SAT Solving
Computational Grids provide a widely distributed computing environment suitable for randomized SAT solving. This paper develops techniques for incorporating clause learning, known to yield significant speed-ups in the sequential case, in such a distributed framework. The approach exploits existing state-of-the-art clause learning SAT solvers by embedding them with virtually no modifications. Th...
متن کاملA Restriction of Extended Resolution for Clause Learning SAT Solvers
Modern complete SAT solvers almost uniformly implement variations of the clause learning framework introduced by Grasp and Chaff. The success of these solvers has been theoretically explained by showing that the clause learning framework is an implementation of a proof system which is as poweful as resolution. However, exponential lower bounds are known for resolution, which suggests that signi...
متن کاملABT with Clause Learning for Distributed SAT
Transforming a planning instance into a propositional formula φ to be solved by a SAT solver is a common approach in AI planning. In the context of multiagent planning, this approach causes the distributed SAT problem: given φ distributed among agents –each agent knows a part of φ but no agent knows the whole φ–, check if φ is SAT or UNSAT by message passing. On the other hand, Asynchronous Bac...
متن کاملControl-Based Clause Sharing in Parallel SAT Solving
Conflict driven clause learning, one of the most important component of modern SAT solvers, is also recognized as very important in parallel SAT solving. Indeed, it allows clause sharing between multiple processing units working on related (sub)problems. However, without limitation, sharing clauses might lead to an exponential blow up in communication or to the sharing of irrelevant clauses. Th...
متن کاملExtending Clause Learning of SAT Solvers with Boolean Gröbner Bases
We extend clause learning as performed by most modern SAT Solvers by integrating the computation of Boolean Gröbner bases into the conflict learning process. Instead of learning only one clause per conflict, we compute and learn additional binary clauses from a Gröbner basis of the current conflict. We used the Gröbner basis engine of the logic package Redlog contained in the computer algebra s...
متن کامل